A construction of small regular bipartite graphs of girth 8
نویسنده
چکیده
Let q be a prime a power and k an integer such that 3 ≤ k ≤ q. In this paper we present a method using Latin squares to construct adjacency matrices of k-regular bipartite graphs of girth 8 on 2(kq − q) vertices. Some of these graphs have the smallest number of vertices among the known regular graphs with girth 8.
منابع مشابه
The distinguishing chromatic number of bipartite graphs of girth at least six
The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...
متن کاملNew Examples of Graphs without Small Cycles and of Large Size
For any prime power q ≥ 3, we consider two infinite series of bipartite q–regular edge–transitive graphs of orders 2q and 2q which are induced subgraphs of regular generalized 4–gon and 6–gon, respectively. We compare these two series with two families of graphs,H3(p) andH5(p), p is a prime, constructed recently by Wenger ([26]), which are new examples of extremal graphs without 6– and 10–cycle...
متن کاملConstructions of small regular bipartite graphs of girth 6
In this article, some structures in the projective plane of order q are found which allow us to construct small k regular balanced bipartite graphs of girth 6 for all k ≤ q . When k = q , the order of these q-regular graphs is 2(q2−1); andwhen k ≤ q−1, the order of these k -regular graphs is 2(qk − 2). Moreover, the incidence matrix of a k -regular balanced bipartite graph of girth 6 having 2(q...
متن کاملOn Subgraphs in Distance-Regular Graphs
Terwilliger [15] has given the diameter bound d < (s 1)(k 1) + 1 for distance-regular graphs with girth 2s and valency k. We show that the only distance-regular graphs with even girth which reach this bound are the hypercubes and the doubled Odd graphs. Also we improve this bound for bipartite distance-regular graphs. Weichsel [17] conjectures that the only distance-regular subgraphs of a hyper...
متن کاملExplicit Construction of Graphs with an Arbitrary Large Girth and of Large Size
Let k ≥ 3 be a positive odd integer and q be a power of a prime. In this paper we give an explicit construction of a q–regular bipartite graph on v = 2q vertices with girth g ≥ k + 5. The constructed graph is the incidence graph of a flag–transitive semiplane. For any positive integer t we also give an example of a q = 2–regular bipartite graph on v = 2q vertices with girth g ≥ k + 5 which is b...
متن کامل